(d, 1)-total Labelling of Planar Graphs with Large Girth and High Maximum Degree
نویسندگان
چکیده
The (d, 1)-total number λ T d (G) of a graph G is the width of the smallest range of integers that suffices to label the vertices and the edges of G so that no two adjacent vertices have the same label, no two incident edges have the same label and the difference between the labels of a vertex and its incident edges is at least d. This notion was introduced in Havet. In this talk, we present our results concerning the planar graphs with large girth and high maximum degree, we have obtained that ∆.λ T d (G) ≤ ∆ + 2d − 2 Our results are optimal for d = 2.
منابع مشابه
(2,1)-Total labeling of planar graphs with large maximum degree
The (d,1)-total labelling of graphs was introduced by Havet and Yu. In this paper, we prove that, for planar graph G with maximum degree ∆ ≥ 12 and d = 2, the (2,1)-total labelling number λ2 (G) is at most ∆ + 2.
متن کاملList coloring the square of sparse graphs with large degree
We consider the problem of coloring the squares of graphs of bounded maximum average degree, that is, the problem of coloring the vertices while ensuring that two vertices that are adjacent or have a common neighbour receive different colors. Borodin et al. proved in 2004 and 2008 that the squares of planar graphs of girth at least seven and sufficiently large maximum degree ∆ are list (∆ + 1)-...
متن کاملOn reverse degree distance of unicyclic graphs
The reverse degree distance of a connected graph $G$ is defined in discrete mathematical chemistry as [ r (G)=2(n-1)md-sum_{uin V(G)}d_G(u)D_G(u), ] where $n$, $m$ and $d$ are the number of vertices, the number of edges and the diameter of $G$, respectively, $d_G(u)$ is the degree of vertex $u$, $D_G(u)$ is the sum of distance between vertex $u$ and all other vertices of $G$, and $V(G)$ is the...
متن کاملThe distinguishing chromatic number of bipartite graphs of girth at least six
The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling with $d$ labels that is preserved only by a trivial automorphism. The distinguishing chromatic number $chi_{D}(G)$ of $G$ is defined similarly, where, in addition, $f$ is assumed to be a proper labeling. We prove that if $G$ is a bipartite graph of girth at least six with the maximum ...
متن کاملTotal Colorings of Planar Graphs with Small Maximum Degree
Let G be a planar graph of maximum degree ∆ and girth g, and there is an integer t(> g) such that G has no cycles of length from g+1 to t. Then the total chromatic number of G is ∆+1 if (∆,g, t) ∈ {(5,4,6),(4,4,17)}; or ∆ = 3 and (g, t) ∈ {(5,13),(6,11),(7,11), (8,10),(9,10)}, where each vertex is incident with at most one g-cycle. 2010 Mathematics Subject Classification: 05C15
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 307 شماره
صفحات -
تاریخ انتشار 2007